Single-machine scheduling problems with a learning effect
نویسندگان
چکیده
منابع مشابه
Some Single - Machine Scheduling Problems with a Mixed Learning Function
Recently, the topic of scheduling with learning effects has kept growing attention, and a survey is further provided to classify the learning models in scheduling into two types, namely position-based learning and sum-ofprocessingtimes-based learning. However, the actual processing time of a given job fast drops to zero as the number of jobs increases in the first model and when the normal job ...
متن کاملSingle Machine Scheduling Problems with Time-dependent Learning Effects
In traditional scheduling problems, most literature assumes that the processing time of a job is fixed. However, there are many situations where the processing time of a job depends on the starting time or the position of the job in a sequence. In such situations, the actual processing time of a job may be more or less than its normal processing time if it is scheduled later. This phenomenon is...
متن کاملSingle machine scheduling problems
In this paper, single machine scheduling problems with sequence dependent setup times are considered. The objective is to minimize the total weighted tardiness. The single machine total weighted tardiness (SMTWT) scheduling problems with sequence dependent setup times were proved to be strongly NP-hard. A recently developed meta-heuristic algorithm called as crow search algorithm is proposed to...
متن کاملA single-machine learning effect scheduling problemwith release times
Article history: Received 29 February 2008 Accepted 16 January 2009 Available online 30 January 2009
متن کاملOn parallel machine scheduling problems with a single server1
In this paper we consider the problem of scheduling jobs on parallel machines with setup times. The setup has to be performed by a single server. The objective is to minimize the schedule length (makespan) as well as the forced idle time. The makespan problem is known to be NP -hard even for the case of two identical parallel machines. This paper presents a pseudopolynomial algorithm for the ca...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematical Modelling
سال: 2008
ISSN: 0307-904X
DOI: 10.1016/j.apm.2007.03.001